Polynomial bases for continuous function spaces
نویسندگان
چکیده
Let S ⊂ R denote a compact set with infinite cardinality and C(S) the set of real continuous functions on S. We investigate the problem of polynomial and orthogonal polynomial bases of C(S). In case of S = {s0, s1, s2, . . .} ∪ {σ}, where (sk)k=0 is a monotone sequence with σ = limk→∞ sk, we give a sufficient and necessary condition for the existence of a so-called Lagrange basis. Furthermore, we show that little q-Jacobi polynomials which fulfill a certain boundedness property constitute a basis in case of Sq = {1, q, q, . . .} ∪ {0}, 0 < q < 1.
منابع مشابه
New Bases for Polynomial-Based Spaces
Since it is well-known that the Vandermonde matrix is ill-conditioned, while the interpolation itself is not unstable in function space, this paper surveys the choices of other new bases. These bases are data-dependent and are categorized into discretely l2-orthonormal and continuously L2-orthonormal bases. The first one construct a unitary Gramian matrix in the space l2(X) while the late...
متن کاملNew characterizations of fusion bases and Riesz fusion bases in Hilbert spaces
In this paper we investigate a new notion of bases in Hilbert spaces and similar to fusion frame theory we introduce fusion bases theory in Hilbert spaces. We also introduce a new denition of fusion dual sequence associated with a fusion basis and show that the operators of a fusion dual sequence are continuous projections. Next we dene the fusion biorthogonal sequence, Bessel fusion basis, Hil...
متن کاملOperator-valued bases on Hilbert spaces
In this paper we develop a natural generalization of Schauder basis theory, we term operator-valued basis or simply ov-basis theory, using operator-algebraic methods. We prove several results for ov-basis concerning duality, orthogonality, biorthogonality and minimality. We prove that the operators of a dual ov-basis are continuous. We also dene the concepts of Bessel, Hilbert ov-basis and obta...
متن کاملGlobal optimization of mixed-integer polynomial programming problems: A new method based on Grobner Bases theory
Mixed-integer polynomial programming (MIPP) problems are one class of mixed-integer nonlinear programming (MINLP) problems where objective function and constraints are restricted to the polynomial functions. Although the MINLP problem is NP-hard, in special cases such as MIPP problems, an efficient algorithm can be extended to solve it. In this research, we propose an algorit...
متن کاملA Numerical Approach for Solving of Two-Dimensional Linear Fredholm Integral Equations with Boubaker Polynomial Bases
In this paper, a new collocation method, which is based on Boubaker polynomials, is introduced for the approximate solutions of a class of two-dimensional linear Fredholm integral equationsof the second kind. The properties of two-dimensional Boubaker functions are presented. The fundamental matrices of integration with the collocation points are utilized to reduce the solution of the integral ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004